Spanning k-Forests with Large Components in K1, k+1-Free Graphs
نویسندگان
چکیده
For an integer k with k ≥ 2, a k-tree (resp. a k-forest) is a tree (resp. forest) with maximum degree at most k. In this paper, we show that for any integer k with k ≥ 3, any connected K1,k+1-free graph has a spanning k-tree or a spanning k-forest with only large components.
منابع مشابه
2-Factors in r-Connected {K1,k, P4}-Free Graphs
In [3], Faudree et.al. considered the proposition “Every {X, Y }-free graph of sufficiently large order has a 2-factor,” and they determined those pairs {X, Y } which make this proposition true. Their result says that one of them is {X, Y } = {K1,4, P4}. In this paper, we investigate the existence of 2-factors in r-connected {K1,k, P4}-free graphs. We prove that if r ≥ 1 and k ≥ 2, and if G is ...
متن کاملA Toughness Condition for a Spanning Tree With Bounded Total Excesses
Let k be an integer with k ≥ 2. In terms of the toughness of a graph, Win gave a sufficient condition for the existence of a spanning k-tree, that is, a spanning tree in which the maximum degree is at most k. For a spanning tree T of a graph G, we define the total excess te(T, k) of T from k as te(T, k) := ∑ v∈V (T )max{dT (v)−k, 0}, where V (T ) is the vertex set of T and dT (v) is the degree ...
متن کاملTotal vertex irregularity strength of corona product of some graphs
A vertex irregular total k-labeling of a graph G with vertex set V and edge set E is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. The total vertex irregularity strength of G, denoted by tvs(G)is the minimum value of the largest label k over all such irregular assignment. In this paper, we study the to...
متن کاملIndistinguishability of the components of random spanning forests
We prove that the infinite components of the Free Uniform Spanning Forest (FUSF) of a Cayley graph are indistinguishable by any invariant property, given that the forest is different from its wired counterpart. Similar result is obtained for the Free Minimal Spanning Forest (FMSF). We also show that with the above assumptions there can only be 0, 1 or infinitely many components, which solves th...
متن کاملToughness and spanning trees in K4mf graphs
A k-tree is a tree with maximum degree at most k, and a k-walk is a closed walk with each vertex repeated at most k times. A k-walk can be obtained from a k-tree by visiting each edge of the k-tree twice. Jackson and Wormald conjectured in 1990 that for k ≥ 2, every 1 k−1 -tough connected graph contains a spanning k-walk. This conjecture is open even for planar graphs. We confirm this conjectur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 31 شماره
صفحات -
تاریخ انتشار 2015